Parallel Iterative Solvers and Preconditioners Using Approximate Hierarchical Methods ( An Extended

نویسندگان

  • Ananth Grama
  • Vipin Kumar
  • Ahmed Sameh
چکیده

In this paper, we report results of the performance, convergence, and accuracy of a parallel GMRES solver for Boundary Element Methods. The solver uses a hierarchical approximate matrix-vector product based on a hybrid Barnes-Hut / Fast Multipole Method. We study the impact of various accuracy parameters on the convergence and show that with minimal loss in accuracy, our solver yields significant speedups. We demonstrate the excellent parallel efficiency and scalability of our solver. The combined speedups from approximation and parallelism represent an improvement of several orders in solution time. We also develop fast and paralellizable preconditioners for this problem. We report on the performance of an inner-outer scheme and a preconditioner based on truncated Green’s function. Experimental results on a 256 processor Cray T3D are presented.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Factorization-based Sparse Solvers and Preconditioners

Efficient solution of large-scale, ill-conditioned and highly-indefinite algebraic equations often relies on high quality preconditioners together with iterative solvers. Because of their robustness, factorizationbased algorithms play a significant role in developing scalable solvers. We discuss the state-of-the-art, high performance sparse factorization techniques which are used to build spars...

متن کامل

Sparse Approximate Inverse Preconditioners for Iterative Solvers on GPUs

For the solution of large systems of linear equations, iterative solvers with preconditioners are typically employed. However, the design of preconditioners for the black-box case, in which no additional information about the underlying problem is known, is very difficult. The most commonly employed method of incomplete LU factorizations is a serial algorithm and thus not well suited for the ma...

متن کامل

Hierarchical-Matrix Preconditioners for Parabolic Optimal Control Problems

Hierarchical (H)-matrices approximate full or sparse matrices using a hierarchical data sparse format. The corresponding H-matrix arithmetic reduces the time complexity of the approximate H-matrix operators to almost optimal while maintains certain accuracy. In this paper, we represent a scheme to solve the saddle point system arising from the control of parabolic partial differential equations...

متن کامل

Efficient Preconditioning Strategies for the Multilevel Fast Multipole Algorithm

For the iterative solutions of the integral equation methods employing the multilevel fast multipole algorithm (MLFMA), effective preconditioning techniques should be developed for robustness and efficiency. Preconditioning techniques for such problems can be broadly classified as fixed preconditioners that are generated from the sparse near-field matrix and variable ones that can make use of M...

متن کامل

A Numerical Study of Some Parallel Algebraic Preconditioners

We present a numerical study of several parallel algebraic preconditioners, which speed up the convergence of Krylov iterative methods when solving large-scale linear systems. The studied algebraic preconditioners are of two types. The first type includes simple block preconditioners using incomplete factorizations or preconditioned Krylov solvers on the subdomains. The second type is an enhanc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996